Dynamic Planar Range Maxima Queries

We consider the dynamic two-dimensional maxima query problem. Let P be a set of n points in the plane. A point is maximal if it is not dominated by any other point in P . We describe two data structures that support the reporting of the t maximal points that dominate a given query point, and allow for insertions and deletions of points in P . In the pointer machine model we present a linear space data structure with O(logn+ t) worst case query time and O(logn) worst case update time. This is the first dynamic data structure for the planar maxima dominance query problem that achieves these bounds in the worst case. The data structure also supports the more general query of reporting the maximal points among the points that lie in a given 3-sided orthogonal range unbounded from above in the same complexity. We can support 4-sided queries in O(log n+ t) worst case time, and O(log n) worst case update time, using O(n logn) space, where t is the size of the output. This improves the worst case deletion time of the dynamic rectangular visibility query problem from O(log n) to O(log n). We adapt the data structure to the RAM model with word size w, where the coordinates of the points are integers in the range U={0, . . . , 2−1}. We present a linear space data structure that supports 3-sided range maxima queries in O( logn log logn +t) worst case time and updates in O( logn log logn ) worst case time. These are the first sublogarithmic worst case bounds for all operations